Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
نویسندگان
چکیده
In 2004, Bajard, Imbert and Plantard introduced a new system of representation to perform arithmetic modulo a prime integer p, the Adapted Modular Number System (AMNS). In this system, the elements are seen as polynomial of degree n − 1 with the coefficients of size p. The best method for multiplication in AMNS works only for some specific moduli p. In this paper, we propose a novel algorithm to perform the modular multiplication in the AMNS. This method works for any AMNS, and does not use a special form of the modulo p. We also present a version of this algorithm in Lagrange Representation which performs the polynomial multiplication part of the first algorithm efficiently using Fast Fourier Transform.
منابع مشابه
EFFICIENT SIMULATION FOR OPTIMIZATION OF TOPOLOGY, SHAPE AND SIZE OF MODULAR TRUSS STRUCTURES
The prevalent strategy in the topology optimization phase is to select a subset of members existing in an excessively connected truss, called Ground Structure, such that the overall weight or cost is minimized. Although finding a good topology significantly reduces the overall cost, excessive growth of the size of topology space combined with existence of varied types of design variables challe...
متن کاملOn the Satisfiability of Modular Arithmetic Formula
Modular arithmetic is the underlying integer computation model in conventional programming languages. In this paper, we discuss the satisfiability problem of modular arithmetic formulae over the finite ring Z2ω . Although an upper bound of 2 2 4) can be obtained by solving alternation-free Presburger arithmetic, it is easy to see that the problem is in fact NP-complete. Further, we give an effi...
متن کاملModular Number Systems: Beyond the Mersenne Family
In SAC 2003, J. Chung and A. Hasan introduced a new class of specific moduli for cryptography, called the more generalized Mersenne numbers, in reference to J. Solinas’ generalized Mersenne numbers proposed in 1999. This paper pursues the quest. The main idea is a new representation, called Modular Number System (MNS), which allows efficient implementation of the modular arithmetic operations r...
متن کاملOn the Satisfiability of Modular Arithmetic Formulae
Modular arithmetic is the underlying integral computation model in conventional programming languages. In this paper, we discuss the satisfiability problem of propositional formulae in modular arithmetic over the finite ring Z2ω . Although an upper bound of 2 2 O(n4) can be obtained by solving alternation-free Presburger arithmetic, it is easy to see that the problem is in fact NP-complete. Fur...
متن کاملAn IWS Montgomery Modular Multiplication Algorithm
We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery's method adapted to mixed radix, and is performed using a Residue Number System. By choosing the moduli of the RNS system reasonably large, and implementing the system on a ring of fairly simple processors, the carry-free nature of RNS arithmetic achieves an eeect corresponding to a redunda...
متن کامل